Open Source OCaml (Objective Caml) Mathematics Software
Sort By:
OCaml (Objective Caml) Mathematics Software
View 202 business solutionsBrowse free open source OCaml (Objective Caml) Mathematics Software and projects below. Use the toggles on the left to filter open source OCaml (Objective Caml) Mathematics Software by OS, license, language, programming language, and project status.
-
Ship Agents FasterGemini Enterprise Agent Platform lets you rapidly build, scale, govern and optimize production-ready agents grounded in your organization's data. The platform enables developers to build custom or pre-built agents for virtually any use case. New customers get $300 in free credits.
-
Veeam Data Platform v13.1 - Get Your Free TrialTry Veeam Data Platform today. Experience the unified platform that's secure by design, portable by default, and proven to recover clean, fast, and anywhere.
-
1
Archive of Formal Proofs
A collection of machine-checkend mathematical proofs
The Archive of Formal Proofs is a collection of proof libraries, examples, and larger scientifc developments, mechanically checked in the theorem prover Isabelle. It is organized in the way of a scientific journal. Submissions are refereed. -
2
ocaml-glpk
OCaml bindings for GLPK
OCaml bindings for the GLPK (GNU Linear Programming Kit) library for solving linear programming and mixed integer programming problems. -
3
TopDeg
Program for topological degree calculation.
The program calculates the degree deg(f,B,0) where B is a product of n nontrivial intervals in R^n and f is a continuous function from B to R^n. The algorithm is described in the following paper: http://www.ams.org/journals/mcom/2015-84-293/S0025-5718-2014-02877-9/ -
4
The Decision Procedure Toolkit (DPT) is a system of cooperating decision procedures for answering satisfiability queries. The DPT implementation in OCaml comprises a DPLL-style SAT solver with theory-specific decision procedures.
-
$300 Free Credits to Build on Google CloudPut your $300 in credit toward real workloads, then keep building with free monthly usage for 20+ products. No commitment and no charge until you upgrade.
-
5
An ML-based automated theorem prover for propositional logic making use of an algorithm in the intercalation calculus.
-
6
A collection of tools for formalizing programming languages and compilers, based around the Coq proof assistant
-
7
-
8
strid is a tool to generate string diagrams for inclusion in LaTeX documents. It has a syntax which is inspired of Xy-matrix, but dual diagrams are generated.
-
9
Cellular Automata simulator. Native code (fast) and modular design: update rule, topology, time, measurement, initialization are independant. No GUI (for now...): configuration file (commented default automatically generated) overridable by command line.
-
Build Securely on AWS with Proven FrameworksMoving to the cloud brings new challenges. How can you manage a larger attack surface while ensuring great network performance? Turn to Fortinet’s Tested Reference Architectures, blueprints for designing and securing cloud environments built by cybersecurity experts. Learn more and explore use cases in this white paper.
-
10
OCaml FEM provides a set of libraries to facilitate writing of finite element codes in OCaml (http://caml.inria.fr/). It provides uniform interaction with several meshers, examples of FEM code using Lacaml.
-
11
OCaml interface to FFTW3 -- the Fastest Fourier Transform in the West! (http://www.fftw.org/). The code is developed at https://github.com/Chris00/fftw-ocaml
-
12
OMF provides an open source OCAML library which unites formal and numerical computations in a single tool. This library provides a common data representation of expressions that lets the user switch painlessly from one world to the other.
-
13
This is an ocaml binding for LevMar Minimization library. The library offers minimization from IR^n to IR^d finding the point which minimizes the distance ||f(p)-x0|| where x0 is the solution in the image space. The binding enables to use ocaml functions
-
14
-
15
SURIKATA (Syntactic Universal Reasoning for Inducing Kolmogorov Abstract Theories Automatically) is a system for searching large spaces of artifacts and inducing algorithms for generating similar artifacts.
- Previous
- You're on page 1
- Next
